Special Cases and Substitutes for Rigid E -Unification
نویسندگان
چکیده
منابع مشابه
Implementing rigid e-unification
Rigid E-unification problems arise naturally in automated theorem provers that deal with equality. While there is a lot of theory about rigid E-unification, only few implementations exist. Since the problem is NPcomplete, direct implementations of the theory are slow. In this paper we discuss how to implement a rigid E-unifier, focussing on efficiency. First, we introduce an efficient represent...
متن کاملRigid E-unification
By replacing syntactical unification with rigid E-unification, equality handling can be added to rigid variable calculi for first-order logic, including free variable tableau (Fitting, 1996), the mating method (Andrews, 1981), the connection method (Bibel, 1982), and model elimination (Loveland, 1969); for an overview of these calculi, see Chapters I.1.1 and I.1.2. Rigid E-unification and its s...
متن کاملBernhard Beckert Rigid E - Unification
By replacing syntactical unification with rigid E-unification, equality handling can be added to rigid variable calculi for first-order logic, including free variable tableau (Fitting, 1996), the mating method (Andrews, 1981), the connection method (Bibel, 1982), and model elimination (Loveland, 1969); for an overview of these calculi, see Chapters I.1.1 and I.1.2. Rigid E-unification and its s...
متن کاملHigher-Order Rigid E-Unification
Higher-order E-uniication, i.e. the problem of nding substitutions that make two simply typed-terms equal modulo or-equivalence and a given equational theory, is undecidable. We propose to rigidify it, to get a resource-bounded decidable uniication problem (with arbitrary high bounds), providing a complete higher-order E-uniication procedure. The techniques are inspired from Gallier's rigid E-u...
متن کاملEfficient Algorithms for Bounded Rigid E-unification
Rigid E -unification is the problem of unifying two expressions modulo a set of equations, with the assumption that every variable denotes exactly one term (rigid semantics). This form of unification was originally developed as an approach to integrate equational reasoning in tableau-like proof procedures, and studied extensively in the late 80s and 90s. However, the fact that simultaneous rigi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing
سال: 2000
ISSN: 0938-1279,1432-0622
DOI: 10.1007/s002000050001